Dense Packing of Equal Circles on a Sphere by the Minimum-Zenith Method: Symmetrical Arrangement
نویسندگان
چکیده
Dense packing of equal circles on a sphere is investigated. A systematic algorithm, the Minimum-Zenith Method (MZM), is proposed in this report. Started from a proper initial configuration, a circle is sequentially packed one by one so that the zenith angle is as small as possible. It is necessary to fix the size of the circle and some initial configuration. Circle configurations we examined have threeto six-fold rotational symmetry. The densest one among them for a specified circle number is the desired configuration of the method. All the cases up to N = 150 are studied in this paper. The obtained packing densities are equal to or slightly smaller than those by other methods (exact solutions, Monte-Carlo method, etc.) in spite of simplicity of the method.
منابع مشابه
The packing of circles on a hemisphere
The problem of the closest packing of N equal nonoverlapping circles on a sphere has been of interest in geometry, chemistry, biology, engineering and optimization. The problem of packing N equal nonoverlapping circles on a hemisphere is a different problem of the same type and is also of interest in various fields such as detecting signals in a multisource neighbourhood and measuring solar rad...
متن کاملSerial Symmetrical Relocation Algorithm for the Equal Sphere Packing Problem
For dealing with the equal sphere packing problem, we propose a serial symmetrical relocation algorithm, which is effective in terms of the quality of the numerical results. We have densely packed up to 200 equal spheres in spherical container and up to 150 equal spheres in cube container. All results are rigorous because of a fake sphere trick. It was conjectured impossible to pack 68 equal sp...
متن کاملPacking Circles in a Square A Review and New Results
There are many interesting optimization problems associated with the packing and covering of objects in a closed volume or bounded surface Typical examples arise in classical physics or chemistry where questions of the kind what does the densest packing of atoms or molecules look like when a crystal or macro molecule is formed with the lowest energy Also engineering and information science conf...
متن کاملPacking up to 50 Equal Circles in a Square
The Hungarian mathematician Farkas Bolyai (1775–1856) published in his principal work (‘Tentamen’, 1832–33 [Bol04]) a dense regular packing of equal circles in an equilateral triangle (see Fig. 1). He defined an infinite packing series and investigated the limit of vacuitas (in Latin, the gap in the triangle outside the circles). It is interesting that these packings are not always optimal in s...
متن کاملOnline Circle and Sphere Packing
In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones receive an online sequence of circles (items) of different radii while the third one receive an online sequence of spheres (items) of different radii, and they want to pack the items into the minimum number of unit squares...
متن کامل